What is the optimal cutoff surface for ore bodies with more than one mineral?

In mine planning problems, cutoff grade optimization defines a threshold at every time period such that material above this value is processed, and the rest is considered waste. In orebodies with multiple minerals, which occur in practice, the natural extension is to consider a cutoff surface. We show that in two dimensions the optimal solution is a line, and in n dimensions it is a hyperplane.     

Multistrain edge‐based compartmental model on networks

Multistrain diseases, which are infected through individual contacts, pose severe public health threat nowadays. In this paper, we build competitive and mutative two‐strain edge‐based compartmental models using probability generation function (PGF) and pair approximation (PA). Both of them are ordinary differential equations. Their basic reproduction numbers and final size formulas are explicitly derived. We show that the formula gives a unique positive final epidemic size when the reproduction number is larger than unity. We further consider competitive and mutative multistrain diseases spreading models and compute their basic reproduction numbers. We perform numerical simulations that show some dynamical properties of the competitive and mutative two‐strain models.     

Poisson discretizations of Wiener functionals and Malliavin operators with Wasserstein estimates

This article proposes a global, chaos-based procedure for the discretization of functionals of Brownian motion into functionals of a Poisson process with intensity $\lambda >0$. Under this discretization we study the weak convergence, as the intensity of the underlying Poisson process goes to infinity, of Poisson functionals and their corresponding Malliavin-type derivatives to their Wiener counterparts. In addition, we derive a convergence rate of $O\left({\lambda }^{?1∕4}\right)$ for the Poisson discretization of Wiener functionals by combining the multivariate Chen–Stein method with the Malliavin calculus. Our proposed sufficient condition for establishing the mentioned convergence rate involves the kernel functions in the Wiener chaos, yet we provide examples, especially the discretization of some common path dependent Wiener functionals, to which our results apply without committing the explicit computations of such kernels. To the best our knowledge, these are the first results in the literature on the universal convergence rate of a global discretization of general Wiener functionals.     

Powers of edge ideals with linear resolutions

We show that if G is a gap-free and diamond-free graph, then I(G)^s has a linear minimal free resolution for every s≥2.     

A novel rigid wheel for agricultural machinery applicable to paddy field with muddy soil

The working performance of agricultural machinery is largely determined by the walking performance of the wheel when driving in complex unstructured soil. However, the driving performance of existing wheels is not satisfactory for paddy field with muddy soil. The purpose of the current study is therefore to propose a novel rigid wheel for agricultural machinery which is applicable to paddy field with muddy soil. Firstly, a novel arc edge shaped wheel was designed based on the principles of mechanics on the ground. Then the driving performance of this arc edge shaped wheel was evaluated using FE modeling of interaction between rigid wheel and soil. Finally, the structure originally designed arc edge shaped wheel was improved according to FE modeling results, and this improved design was further evaluated by both FE simulation and prototype experiments. Both FE modeling and experimental results indicate that the improved arc edge shaped wheel proposed in this study has a good driving performance with regarding to wheel sinkage and soil reaction force. The proposed arc edge shaped wheel could be used as an effective component of rice harvester for paddy field with muddy soil.     

Analytic hierarchy process for multi-sensor data fusion based on belief function theory

Multi-sensor data fusion is an evolving technology whereby data from multiple sensor inputs are processed and combined. The data derived from multiple sensors can, however, be uncertain, imperfect, and conflicting. The present study is undertaken to help contribute to the continuous search for viable approaches to overcome the problems associated with data conflict and imperfection. Sensor readings, represented by belief functions, have to be fused according to their corresponding weights. Previous studies have often estimated the weights of sensor readings based on a single criterion. Mono-criteria approaches for the assessment of sensor reading weights are, however, often unreliable and inadequate for the reflection of reality. Accordingly, this work opts for the use of a multi-criteria decision aid. A modified Analytical Hierarchy Process (AHP) that incorporates several criteria is proposed to determine the weights of a sensor reading set. The approach relies on the automation of pairwise comparisons to eliminate subjectivity and reduce inconsistency. It assesses the weight of each sensor reading, and fuses the weighed readings obtained using a modified average combination rule. The efficiency of this approach is evaluated in a target recognition context. Several tests, sensitivity analysis, and comparisons with other approaches available in the literature are described.     

Edge proximity and matching extension in projective planar graphs

A graph $G$ with at least $2m+2$ vertices is said to be distance $d$ $m$-extendable if, for any matching $M$ of $G$ with $m$ edges in which the edges lie at distance at least $d$ pairwise, there exists a perfect matching of $G$ containing $M$. In this paper we prove that every 5-connected triangulation on the projective plane of even order is distance 3 7-extendable and distance 4 $m$-extendable for any $m$.